Two fast constructions of compact representations of binary words with given set of periods
نویسندگان
چکیده
منابع مشابه
Diameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملcompactifications and representations of transformation semigroups
this thesis deals essentially (but not from all aspects) with the extension of the notion of semigroup compactification and the construction of a general theory of semitopological nonaffine (affine) transformation semigroup compactifications. it determines those compactification which are universal with respect to some algebric or topological properties. as an application of the theory, it is i...
15 صفحه اولPeriods and Binary Words
We give an elementary short proof for a well-known theorem of Guibas and Odlyzko stating that the sets of periods of words are independent of the alphabet size. As a consequence of our constructing proof, we give a linear time algorithm which, given a word, computes a binary one with the same periods. We give also a very short proof for the famous Fine and Wilf's periodicity lemma.
متن کاملdegradation of oil impregnated paper insulation under influence of repetitive fast high voltage impulses
در طی سالهای اخیراستفاده ازمنابع انرژی تجدید پذیر در شبکه های مدرن بنا به دلایل زیست محیطی و اقتصادی به طور گسترده استفاده شده است همچون نیروگاههای بادی و خورشیدی .ولتاژتولیدی این نیروگاهها اغلب به فرم dc می باشد وادوات الکترونیک قدرت به عنوان مبدل و پل بین شکل موج dc وac استفاده می شوند.این پروسه باعث ایجاد پالسهایی برروی شکل موج خروجی می شود که می تواند وارد تجهیزات قدرت همچون ترانسفورماتور ی...
15 صفحه اولdiameter two graphs of minimum order with given degree set
the degree set of a graph is the set of its degrees. kapoor et al. [degree sets for graphs, fund. math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. furthermore, the minimum order of such a graph is determined. a graph is 2-self- centered if its radius and diameter are two. in this paper for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.04.027